Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards
نویسندگان
چکیده
منابع مشابه
Optimally Guarding 2-Reflex Orthogonal Polyhedra by Reflex Edge Guards
We study the problem of guarding an orthogonal polyhedron having reflex edges in just two directions (as opposed to three) by placing guards on reflex edges only. We show that ⌊ r − g 2 ⌋
متن کاملEdge-guarding Orthogonal Polyhedra
We address the question: How many edge guards are needed to guard an orthogonal polyhedron of e edges, r of which are reflex? It was previously established [3] that e/12 are sometimes necessary and e/6 always suffice. In contrast to the closed edge guards used for these bounds, we introduce a new model, open edge guards (excluding the endpoints of the edge), which we argue are in some sense mor...
متن کاملEdge Guards for Polyhedra in Three-Space
It is shown that every polyhedron in R3 with m edges can be guarded with at most 27 32m edge guards. The bound improves to 6m + 1 12 if the 1-skeleton of the polyhedron is connected. These are the first non-trivial upper bounds for the edge guard problem for general polyhedra in R3.
متن کاملGuarding and Searching Polyhedra
Guarding and searching problems have been of fundamental interest since the early years of Computational Geometry. Both are well-developed areas of research and have been thoroughly studied in planar polygonal settings. In this thesis we tackle the Art Gallery Problem and the Searchlight Scheduling Problem in 3-dimensional polyhedral environments, putting special emphasis on edge guards and ort...
متن کاملGuarding the Vertices of an Orthogonal Terrain using Vertex Guards
A terrain T is an x-monotone polygonal chain in the plane; T is orthogonal if each edge of T is either horizontal or vertical. In this paper, we give an exact algorithm for the problem of guarding the convex vertices of an orthogonal terrain with the minimum number of reflex vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2020
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2019.101589